A local projection stabilized method for fictitious domains
نویسندگان
چکیده
منابع مشابه
A local projection stabilized method for fictitious domains
In this work a local projection stabilization method is proposed to solve a fictitious domain problem. The method adds a suitable fluctuation term to the formulation thus rendering the natural space for the Lagrange multiplier stable. Stability and convergence are proved and these results are illustrated by a numerical experiment.
متن کاملConsistent Local Projection Stabilized Finite Element Methods
Abstract. This work establishes a formal derivation of local projection stabilized methods as a result of an enriched Petrov-Galerkin strategy for the Stokes problem. Both velocity and pressure finite element spaces are enhanced with solutions of residual-based local problems, and then the static condensation procedure is applied to derive new methods. The approach keeps degrees of freedom unch...
متن کاملFictitious Domain Methods Using Cut Elements: Iii. a Stabilized Nitsche Method for Stokes’ Problem
We extend our results on fictitious domain methods for Poisson’s problem to the case of incompressible elasticity, or Stokes’ problem. The mesh is not fitted to the domain boundary. Instead boundary conditions are imposed using a stabilized Nitsche type approach. Control of the non-physical degrees of freedom, i.e., those outside the physical domain, is obtained thanks to a ghost penalty term f...
متن کاملAugmented Stabilized Formulations with Fictitious Boundary Methods
Augmentation of the SUPS formulation was introduced earlier and successfully applied to solving incompressible NavierStokes equations for both two dimensional and three dimensional problems. Fictitious boundary methods (FBM) is a new methodology that aid the study of flow descriptions around solid obstacles on fixed Cartesian product grids that do not require body confirming meshes. FBM has bee...
متن کاملA novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2012
ISSN: 0893-9659
DOI: 10.1016/j.aml.2012.04.020